Large-scale monitoring of DHT traffic

نویسندگان

  • Ghulam Memon
  • Reza Rejaie
  • Yang Guo
  • Daniel Stutzbach
چکیده

Studying deployed Distributed Hash Tables (DHTs) entails monitoring DHT traffic. Commonly, DHT traffic is measured by instrumenting ordinary peers to passively record traffic. In this approach, using a small number of peers leads to a limited (and potentially biased) view of traffic. Alternatively, inserting a large number of peers may disrupt the natural traffic patterns of the DHT and lead to incorrect results. In general, accurately capturing DHT traffic is a challenging task. In this paper, we propose the idea of minimally visible monitors to capture the traffic at a large number of peers with minimum disruption to the DHT. We implement and validate our proposed technique, called Montra, on the Kad DHT. We show that Montra accurately captures around 90% of the query traffic while monitoring roughly 32,000 peers and can accurately identify destination peers for 90% of captured destination traffic. Using Montra, we characterize the traffic in Kad and present our preliminary results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Montra: A large-scale DHT traffic monitor

This paper presents a new technique, called Montra, for accurately capturing traffic in a widely deployed DHT. The basic idea is to make the traffic monitors minimally visible to participating peers to avoid disruption in the system. We describe how Montra leverages the required redundancy in published content and routing to minimize disruption of the system. Validations of Montra over two wide...

متن کامل

Editorial for Computer Networks special issue on "Measurement-based optimization of P2P networking and applications"

Measurement plays an important role in various Peerto-Peer (P2P) applications: for peer selection, data delivery and overlay construction. Since P2P systems may include hundreds of thousands of online peers at the same time, it is necessary for the measurements to be scalable. With a dedicated or co-located measurement element such as a network coordinate system or traffic monitor, a P2P system...

متن کامل

Calot: a Constant-Diameter Low-Traffic Distributed Hash Table

Current Distributed Hash Tables (DHTs) keep a small routing table on each node, achieving low-cost maintenance at the expense of high lookup hop count and therefore high lookup traffic. Some recently proposed DHTs keep a complete routing table on every node to support efficient lookup. However, our analysis reveals that this approach cannot scale beyond a few thousand nodes due to its high main...

متن کامل

Implementation of Random Forest Algorithm in Order to Use Big Data to Improve Real-Time Traffic Monitoring and Safety

Nowadays the active traffic management is enabled for better performance due to the nature of the real-time large data in transportation system. With the advancement of large data, monitoring and improving the traffic safety transformed into necessity in the form of actively and appropriately. Per-formance efficiency and traffic safety are considered as an im-portant element in measuring the pe...

متن کامل

Heterogeneity Aware P2P Algorithm by Using Mobile nodeID

The peer-to-peer systems have become an extremely popular platform for large-scale content sharing. A lot of research papers discussed the Distributed Hash Table (DHT) based p2p algorithms to promise that idle resources may be efficiently harvested. However, p2p systems are composed of components with extremely heterogeneous availabilities and for nodes which join/leave the system frequently, t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009